Quasi-monte Carlo Methods in Computer Graphics, Part I: the Qmc-buuer

نویسندگان

  • Stefan Heinrich
  • Alexander Keller
چکیده

Monte Carlo integration is often used for antialiasing in rendering processes. Due to low sampling rates only expected error estimates can be stated, and the variance can be high. In this article quasi-Monte Carlo methods are presented, achieving a guaranteed upper error bound and a convergence rate essentially as fast as usual Monte Carlo.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chapter 1 Quasi - Monte Carlo Sampling

In Monte Carlo (MC) sampling the sample averages of random quantities are used to estimate the corresponding expectations. The justification is through the law of large numbers. In quasi-Monte Carlo (QMC) sampling we are able to get a law of large numbers with deterministic inputs instead of random ones. Naturally we seek deterministic inputs that make the answer converge as quickly as possible...

متن کامل

Evaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended

The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.

متن کامل

Local Quasi-Monte Carlo Exploration

In physically-based image synthesis, the path space of light transport paths is usually explored by stochastic sampling. The two main families of algorithms are Monte Carlo/quasi-Monte Carlo sampling and Markov chain Monte Carlo. While the former is known for good uniform discovery of important regions, the latter facilitates efficient exploration of local effects. We introduce a hybrid samplin...

متن کامل

Correlated Multi-Jittered Sampling

Image synthesis techniques requiringMonteCarlo integration frequentlyneed to generate uniformly distributed samples within the unit hypercube. The ideal sample generation method will maximize the variance reduction as the numberof samples increases. Strati cationvia jittering is one simple, tractable, R. L. Cook. Stochastic sampling in computer graphics. ACM Transactions on Graphics, 5(1):51–72...

متن کامل

Spherical Fibonacci Point Sets for Illumination Integrals

Quasi-Monte Carlo (QMC) methods exhibit a faster convergence rate than that of classic Monte Carlo methods. This feature has made QMC prevalent in image synthesis, where it is frequently used for approximating the value of spherical integrals (e.g., illumination integral). The common approach for generating QMC sampling patterns for spherical integration is to resort to unit square low discrepa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994